1353D - Constructing the Array - CodeForces Solution

import math,sys
from collections import defaultdict,deque
import bisect as bi
def yes():print('YES')
def no():print('NO')
def I():return (int(sys.stdin.readline()))
def In():return(map(int,sys.stdin.readline().split()))
def Sn():return sys.stdin.readline().strip()
def dict(a):
    d={} 
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d
def find_gt(a, x):
    'Find leftmost value greater than x'
    i = bi.bisect_left(a, x)
    if i != len(a):
        return i
    else:            
        return -1
def main():
    try:
        n=I()
        from heapq import heappush , heappop
        pq = [(-n,0,n-1)]
        ans = [0]*n
        cnt = 1
        while pq and cnt<=n:
            size , start,end = heappop(pq)
            size*=-1
            ind = ((size-1)//2)+start
            ans[ind]=cnt
            if start!=ind:
                heappush(pq,(-(ind-start),start,ind-1))
            if end!=ind:
                heappush(pq,(-(end-ind),ind+1,end))
            cnt+=1
        print(*ans)


    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    for _ in range(I()):main()